Bayesian Partitioning for Classiication and Regression

نویسندگان

  • C Holmes
  • D G T Denison
  • B K Mallick
چکیده

In this paper we propose a new Bayesian approach to data modelling. The Bayesian partition model constructs arbitrarily complex regression and classiication surfaces by splitting the design space into an unknown number of disjoint regions. Within each region the data is assumed to be exchangeable and to come from some simple distribution. Using conjugate priors the marginal likelihoods of the models can be obtained analytically for any proposed partitioning of the space where the number and location of the regions is assumed unknown a priori. Markov chain Monte Carlo simulation techniques are used to obtain distributions on partition structures and by averaging across samples smooth prediction surfaces are formed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian partitioning for classi cation and regressionC

In this paper we propose a new Bayesian approach to data modelling. The Bayesian partition model constructs arbitrarily complex regression and classiication surfaces over the design space by splitting the space into an unknown number of disjoint regions. Within each region the data is assumed to be exchangeable and to come from some simple distribution. Using conjugate priors the marginal likel...

متن کامل

A Hybrid Expert System for Error Message Classiication

A hybrid intelligent classiier is built for pattern classiication. It consists of a classiication and regression tree (CART), a genetic algorithm (GA) and a neural network (NN). CART extracts features of the patterns by setting up decision rules. Rule improvement by GA is explored. The rules act as a pre-processing layer of NN, a multi-class neural classiier, through which the most probable cla...

متن کامل

Boosting with Bayesian stumps

SUMMARY Boosting is a new, powerful method for classiication. It is an iterative procedure which successively classiies a weighted version of the sample, and then reweights this sample dependent on how successful the classiication was. In this paper we review some of the commonly used methods for performing boosting and show how they can be t into a Bayesian setup at each iteration of the algor...

متن کامل

Improving the Performance of Boosting for Naive Bayesian Classification

This paper investigates boosting naive Bayesian classiica-tion. It rst shows that boosting cannot improve the accuracy of the naive Bayesian classiier on average in a set of natural domains. By analyzing the reasons of boosting's failures, we propose to introduce tree structures into naive Bayesian classiication to improve the performance of boosting when working with naive Bayesian classiicati...

متن کامل

Improving the Performance of Boosting forNaive Bayesian Classi cationKai

This paper investigates boosting naive Bayesian classiica-tion. It rst shows that boosting cannot improve the accuracy of the naive Bayesian classiier on average in a set of natural domains. By analyzing the reasons of boosting's failures, we propose to introduce tree structures into naive Bayesian classiication to improve the performance of boosting when working with naive Bayesian classiicati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999